Decoupling of brain function from structure reveals regional behavioral specialization in humans

The brain is an assembly of neuronal populations interconnected by structural pathways. Brain activity is expressed on and constrained by this substrate. Therefore, statistical dependencies between functional signals in directly connected areas can be expected higher. However, the degree to which brain function is bound by the underlying wiring diagram remains a complex question that has been only partially answered. Here, we introduce the structural-decoupling index to quantify the coupling strength between structure and function, and we reveal a macroscale gradient from brain regions more strongly coupled, to regions more strongly decoupled, than expected by realistic surrogate data. This gradient spans behavioral domains from lower-level sensory function to high-level cognitive ones and shows for the first time that the strength of structure-function coupling is spatially varying in line with evidence derived from other modalities, such as functional connectivity, gene expression, microstructural properties and temporal hierarchy

Augmented Slepians: Bandlimited Functions that Counterbalance Energy in Selected Intervals

Slepian functions provide a solution to the optimization problem of joint time-frequency localization. Here, this concept is extended by using a generalized optimization criterion that favors energy concentration in one interval while penalizing energy in another interval, leading to the "augmented" Slepian functions. Mathematical foundations together with examples are presented in order to illustrate the most interesting properties that these generalized Slepian functions show. Also the relevance of this novel energy-concentration criterion is discussed along with some of its applications

Brain decoding: Opportunities and challenges for pattern recognition

The neuroimaging community heavily relies on statistical inference to explain measured brain activity given the experimental paradigm. Undeniably, this method has led to many results, but it is limited by the richness of the generative models that are deployed, typically in a mass-univariate way. Such an approach is suboptimal given the high-dimensional and complex spatiotemporal correlation structure of neuroimaging data

Guided Graph Spectral Embedding: Application to the C. elegans Connectome

Graph spectral analysis can yield meaningful embeddings of graphs by providing insight into distributed features not directly accessible in nodal domain. Recent efforts in graph signal processing have proposed new decompositions-e.g., based on wavelets and Slepians-that can be applied to filter signals defined on the graph. In this work, we take inspiration from these constructions to define a new guided spectral embedding that combines maximizing energy concentration with minimizing modified embedded distance for a given importance weighting of the nodes. We show these optimization goals are intrinsically opposite, leading to a well-defined and stable spectral decomposition. The importance weighting allows to put the focus on particular nodes and tune the trade-off between global and local effects. Following the derivation of our new optimization criterion and its linear approximation, we exemplify the methodology on the C. elegans structural connectome. The results of our analyses confirm known observations on the nematode's neural network in terms of functionality and importance of cells. Compared to Laplacian embedding, the guided approach, focused on a certain class of cells (sensory, inter- and motoneurons), provides more biological insights, such as the distinction between somatic positions of cells, and their involvement in low or high order processing functions.Comment: 43 pages, 7 figures, submitted to Network Neuroscienc

Complex Wavelet Bases, Steerability, and the Marr-Like Pyramid

Our aim in this paper is to tighten the link between wavelets, some classical image-processing operators, and David Marr's theory of early vision. The cornerstone of our approach is a new complex wavelet basis that behaves like a smoothed version of the Gradient-Laplace operator. Starting from first principles, we show that a single-generator wavelet can be defined analytically and that it yields a semi-orthogonal complex basis of L-2 (R-2), irrespective of the dilation matrix used. We also provide an efficient FFT-based filterbank implementation. We then propose a slightly redundant version of the transform that is nearly translation -invariant and that is optimized for better steerability (Gaussian-like smoothing kernel). We call it the Marr-like wavelet pyramid because it essentially replicates the processing steps in Marr's theory of early vision. We use it to derive a primal wavelet sketch which is a compact description of the image by a multiscale, subsampled edge map. Finally, we provide an efficient iterative algorithm for the reconstruction of an image from its primal wavelet sketch

False Discovery Rate for Wavelet-Based Statistical Parametric Mapping

Model-based statistical analysis of functional magnetic resonance imaging (fMRI) data relies on the general linear model and statistical hypothesis testing. Due to the large number of intracranial voxels, it is important to deal with the multiple comparisons problem. Many fMRI analysis tools utilize Gaussian random field theory to obtain a more sensitive thresholding; this typically involves Gaussian smoothing as a preprocessing step. Wavelet-based statistical parametric mapping (WSPM) is an alternative method to obtain parametric maps from non-smoothed data. It relies on adaptive thresholding of the parametric maps in the wavelet domain, followed by voxel-wise statistical testing. The procedure is conservative; it uses Bonferroni correction for strong type I error control. Yet, its sensitivity is close to SPM's due to the excellent denoising properties of the wavelet transform. Here, we adapt the false discovery rate (FDR) principle to the WSPM framework. Although explicit p-values cannot be obtained, we show that it is possible to retrieve the FDR threshold by a simple iterative scheme. We then validate the approach with an event-related visual stimulation task. Our results show better sensitivity with preservation of spatial resolution; i.e., activation clusters align well with the gray matter structures in the visual cortex. The spatial resolution of the activation maps is even high enough to easily identify a voxel that is very likely to be caused by the draining-vein effect